theorem, composition of monotonically strictly increasing function with utility function
#game_theory
Theorem
Let be a set of outcomes, and let be a complete, reflexive, and transitive preference relation over . Suppose is a utility function representing . Then for every monotonically strictly increasing function , the composition defined by
is also a utility function representing .
Notes
The utility function is often called an ordinal function as a result of this theorem, as it represents only the order of preferences between outcomes. Numerical values a utility function associates with outcomes have no significance, and do not represent in any way the "intensity" of the player's preferences.
References
- M. Maschler, E. Solan, and Shmuel Zamir, Game Theory, Cambridge University Press, 2013, p. 11.